Composable, Unconditionally Secure Message Authentication without any Secret Key
نویسنده
چکیده
We consider a setup in which the channel from Alice to Bob is less noisy than the channel from Eve to Bob. We show that there exist encoding and decoding which accomplish error correction and authentication simultaneously; that is, Bob is able to correctly decode a message coming from Alice and reject a message coming from Eve with high probability. The system does not require any secret key shared between Alice and Bob, provides information theoretic security, and can safely be composed with other protocols in an arbitrary context.
منابع مشابه
Information Theoretically Secure Encryption with Almost Free Authentication
In cryptology, secure channels enable the exchange of messages in a confidential and authenticated manner. The literature of cryptology is rich with proposals and analysis that address the secure communication over public (insecure) channels. In this work, we propose an information theoretically secure direction for the construction of secure channels. First, we propose a method of achieving un...
متن کاملA Novel Protocol-Authentication Algorithm Ruling Out a Man-in-the-Middle Attack in Quantum Cryptography
Quantum Key Distribution (QKD) or ”quantum cryptography” is a Quantum Mechanics based cryptographic primitive which, in principle, holds the potential of absolutely secure communication that cannot be compromised by any eavesdropping technique. The strength of the QKD primitive is the unconditionally secure simultaneous generation of two identical bit streams at two distinct locations which sub...
متن کاملUsing Hash-Based Signatures to Bootstrap Quantum Key Distribution
Quantum Key Distribution is a secret distribution technique that requires an authenticated channel. This channel is usually created on top of an un-authenticated communication medium using unconditionally secure Message Authentication Codes (MAC) and an initial common secret. We examine the consequences of replacing this MAC algorithm by a cryptographic hash-based signature algorithm, like the ...
متن کاملCryptography for Unconditionally Secure Message Transmission in Networks (Invited Talk)
We consider the model of unconditionally secure (r-round, n-channel) message transmission schemes which was introduced by Dolev et al. [1]. In this model, there are n channels between a sender and a receiver, and an infinitely powerful adversary A may corrupt (observe and forge) the messages sent through t out of n channels. The sender wishes to send a secret s to the receiver in r-round withou...
متن کاملUniversally Composable Authentication and Key-Exchange with Global PKI
Message authentication and key exchange are two of the most basic tasks of cryptography. Solutions based on public-key infrastructure (PKI) are prevalent. Still, the state of the art in composable security analysis of PKI-based authentication and key exchange is somewhat unsatisfactory. Specifically, existing treatments either (a) make the unrealistic assumption that the PKI is accessible only ...
متن کامل